How to obtain division algebras used for fast-decodable space-time block codes

نویسنده

  • Susanne Pumplün
چکیده

We present families of unital algebras obtained through a doubling process from a cyclic central simple algebra D = (K/F, σ, c), employing a K-automorphism τ and an element d ∈ D×. These algebras appear in the construction of iterated spacetime block codes. We give conditions when these iterated algebras are division which can be used to construct fully diverse iterated codes. We also briefly look at algebras (and codes) obtained from variations of this method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pumpluen, Susanne (2014) How to obtain division algebras used for fast-decodable space-time block

We present families of unital algebras obtained through a doubling process from a cyclic central simple algebra D = (K/F, σ, c), employing a K-automorphism τ and an element d ∈ D. These algebras appear in the construction of iterated spacetime block codes. We give conditions when these iterated algebras are division which can be used to construct fully diverse iterated codes. We also briefly lo...

متن کامل

The nonassociative algebras used to build fast-decodable space-time block codes

Let K/F and K/L be two cyclic Galois field extensions and D = (K/F, σ, c) a cyclic algebra. Given an invertible element d ∈ D, we present three families of unital nonassociative algebras over L ∩ F defined on the direct sum of n copies of D. Two of these families appear either explicitly or implicitly in the designs of fast-decodable space-time block codes in papers by Srinath, Rajan, Markin, O...

متن کامل

Generalized Distributive Law for ML Decoding of Space-Time Block Codes

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known tech...

متن کامل

MMSE Optimal Space-Time Block Codes from Crossed Product Algebras

Design of Space-Time Block codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However the ML decoding complexity of STBCs become prohibitive large as the number of transmit and receive antennas increase. To solve this problem, orthogonal designs, single symbol ML decodable and double symbol ML decodable STBCs have been proposed in the liter...

متن کامل

Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel

In this article, the first general constructions of fast-decodable, more specifically (conditionally) ggroup decodable, space–time block codes for the Nonorthogonal Amplify and Forward (NAF) MultipleInput Multiple-Output (MIMO) relay channel under the half-duplex constraint are proposed. In this scenario, the source and the intermediate relays used for data amplification are allowed to employ m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. in Math. of Comm.

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2014